Experiments in Coset Enumeration
نویسندگان
چکیده
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the most important tools for investigating nitely presented groups. Such methods do not, in general, constitute an algorithm. Each problem has to be addressed individually, and determining whether or not an acceptable solution for a diicult problem can be found using given resources requires an empirical approach (i.e., experimentation). We discuss some of the ideas involved, and illustrate with examples which emphasize some of the possibilities.
منابع مشابه
Parallel Coset Enumeration Using Threads
Coset enumeration is one of the basic tools for investigating nitely presented groups. Many enumerations require signiicant resources, in terms of CPU time or memory space. We develop a fully functional parallel coset enumeration procedure and we discuss some of the issues involved in such parallelisation using the POSIX threads library. Our results can equally well be applied to any master-sla...
متن کاملProving a Group Trivial Made Easy: a Case Study in Coset Enumeration
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating nitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. We show that the problems ar...
متن کاملDouble-coset enumeration algorithm for symmetrically generated groups
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...
متن کاملCoset Enumeration, Permutation Group Algorithms, and Applications to Graphs and Geometries
In these notes we discuss coset enumeration and basic permutation group algorithms. To illustrate some applications to graphs and nite geometries, we classify and study some graphs which are locally the incidence graph of the 2 ? (11; 5; 2) design.
متن کاملCoset Enumeration of Symmetrically Generated Groups Using Gröbner Bases
A new method for coset enumeration in symmetrically generated groups is presented. This method is based on a Gröbner bases algorithm applied to polynomials in non-commuting variables with integer coefficients. Mathematics Subject Classification: 05A05; 20B05; 20B40
متن کامل